feat(ErdosProblems): 847 #1400
Open
feat(ErdosProblems): 847 #1400
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
YaelDillies
reviewed
Dec 20, 2025
YaelDillies
added
the
awaiting-author
Paul-Lez
reviewed
Jan 9, 2026
Co-authored-by: Paul Lezeau <[email protected]>
with HasFew3APs name instead of h\eps
Contributor
Author
|
Done! thanks |
YaelDillies
reviewed
Jan 19, 2026
Comment on lines
27
to
29
| def HasFew3APs (A : Set ℕ) := | ||
| ∃ (ε : ℝ), ε > 0 ∧ ∀ (B : Set ℕ), B ⊆ A → Finite B → | ||
| ∃ (C : Set ℕ), C ⊆ B ∧ C.ncard ≥ ε * B.ncard ∧ ThreeAPFree C |
Collaborator
There was a problem hiding this comment.
Can you inline this definition?
Co-authored-by: Yaël Dillies <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Let$A \subset \mathbb{N}$ be an infinite set for which there exists some $\epsilon > 0$ such that$A$ of size $n$ there is a subset of size at least $\epsilon n$ which contains no
in any subset of
three-term arithmetic progression.
Is it true that$A$ is the union of a finite number of sets which contain no three-term arithmetic
progression?
Closes #973